Some links between extremum spanning forests, watersheds and min-cuts
نویسندگان
چکیده
Minimum cuts, extremum spanning forests and watersheds have been used as the basis for powerful image segmentation procedures. In this paper, we present some results about the links which exist between these different approaches. Especially, we show that extremum spanning forests are particular cases of watersheds from arbitrary markers and that min-cuts coincide with extremum spanning forests for some particular weight functions.
منابع مشابه
Some links between min-cuts, optimal spanning forests and watersheds
Di erent optimal structures: minimum cuts, minimum spanning forests and shortest-path forests, have been used as the basis for powerful image segmentation procedures. The well-known notion of watershed also falls into this category. In this paper, we present some new results about the links which exist between these di erent approaches. Especially, we show that min-cuts coincide with watersheds...
متن کاملWatershed cuts
We study the watersheds in edge-weighted graphs. Contrarily to previous works, we define the watersheds following the intuitive idea of drops of water flowing on a topographic surface. We establish the consistency (with respect to characterizations of the catchment basins and dividing lines) of these watersheds, prove their optimality (in terms of minimum spanning forests) and derive a linear-t...
متن کاملPower Watersheds: A Unifying Graph Based Optimization Framework
In this work, we extend a common framework for graph-based image segmentation that includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing an image as a weighted graph, these algorithms can be expressed by means of a common energy function with differing choices of a parameter q acting as an exponent on the differences between neighboring nodes. Introducing a ...
متن کاملPageRank and random walks on graphs
We examine the relationship between PageRank and several invariants occurring in the study of random walks and electrical networks. We consider a generalized version of hitting time and effective resistance with an additional parameter which controls the ‘speed’ of diffusion. We will establish their connection with PageRank . Through these connections, a combinatorial interpretation of PageRank...
متن کاملVegetation in clear-cuts depends on previous land use: a century-old grassland legacy
Plant species richness in central and northern European seminatural grasslands is often more closely linked to past than present habitat configuration, which is indicative of an extinction debt. In this study, we investigate whether signs of historical grassland management can be found in clear-cuts after at least 80 years as coniferous production forest by comparing floras between clear-cuts w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Image Vision Comput.
دوره 28 شماره
صفحات -
تاریخ انتشار 2010